Matrix Factorizations for Complete Intersections and Minimal Free Resolutions

نویسندگان

  • David Eisenbud
  • Irena Peeva
چکیده

Matrix factorizations of a hypersurface yield a description of the asymptotic structure of minimal free resolutions over the hypersurface, and also define a functor to the stable module category of maximal Cohen-Macaulay modules on the hypersurface. We introduce a new functorial concept of matrix factorizations for complete intersections that allows us to describe the asymptotic structure of minimal free resolutions over complete intersections.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MINIMAL FREE RESOLUTIONS over COMPLETE INTERSECTIONS

We begin the chapter with some history of the results that form the background of this book. We then define higher matrix factorizations, our main focus. While classical matrix factorizations were factorizations of a single element, higher matrix factorizations deal directly with sequences of elements. In section 1.3, we outline our main results. Throughout the book, we use the notation introdu...

متن کامل

Periodic free resolutions from twisted matrix factorizations

Article history: Received 31 May 2015 Available online 1 March 2016 Communicated by Luchezar L. Avramov MSC: primary 16E05, 16E35, 16E65

متن کامل

Remarks on Non-commutative Crepant Resolutions of Complete Intersections

We study obstructions to existence of non-commutative crepant resolutions, in the sense of Van den Bergh, over local complete intersections.

متن کامل

Riordan group approaches in matrix factorizations

In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.

متن کامل

Free Resolutions and Sparse Determinantal Ideals

A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In this paper we extend these results by computing a minimal free resolution for all such sparse determinantal ideals. We do so by introducing a technique for pruning minimal free resolutions when a sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013